18 Multidimensional Data Structures

نویسنده

  • Hanan Samet
چکیده

The representation of multidimensional data is an important issue in applications in diverse fields that include database management systems, computer graphics, computer vision, computational geometry, image processing, geographic information systems (GIS), pattern recognition, VLSI design, and others. The most common definition of multidimensional data is a collection of points in a higher dimensional space. These points can represent locations and objects in space as well as more general records. As an exampleof a record, consider an employee record that has attributes corresponding to the employee’s name, address, sex, age, height, weight, and social security number. Such records arise in database management systems and can be treated as points in, for this example, a seven-dimensional space (i.e., there is one dimension for each attribute), albeit the different dimensions have different type units (i.e., name and address are strings of characters, sex is binary; while age, height, weight, and social security number are numbers). Whenmultidimensional data corresponds to locational data, we have the additional property that all of the attributes have the same unit, which is distance in space. In this case, we can combine the attributes and pose queries that involve proximity. For example, we may wish to find the closest city to Chicago within the two-dimensional space fromwhich the locations of the cities are drawn. Another query seeks to find all cities within 50miles of Chicago. In contrast, such queries are not very meaningful when the attributes do not have the same type. For example, it is not customary to seek the person with age–weight combination closest to John Jones, as we do not have a commonly accepted unit of year-pounds (year-kilograms) or

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Entropy-Compressed Indexes for Multidimensional Pattern Matching

In this talk, we will discuss the challenges involved in developing a multidimensional generalizations of compressed text indexing structures. These structures depend on some notion of Burrows-Wheeler transform (BWT) for multiple dimensions, though naive generalizations do not enable multidimensional pattern matching. We study the 2D case to possibly highlight combinatorial properties that do n...

متن کامل

New Developments of Nonlinear Projections for the Visualization of Structures in Nonvectorial Data Sets

Aalto University, P.O. Box 11000, FI-00076 Aalto www.aalto.fi Author Teuvo Kohonen Name of the publication New Developments of Nonlinear Projections for the Visualization of Structures in Nonvectorial Data Sets Publisher School of Science Unit Department of Information and Computer Science Series Aalto University publication series SCIENCE + TECHNOLOGY 8/2011 Field of research Computer science ...

متن کامل

Multidimensional Data Structures and Techniques for Efficient Decision Making

In this paper we present several novel efficient techniques and multidimensional data structures which can improve the decision making process in many domains. We consider online range aggregation, range selection and range weighted median queries; for most of them, the presented data structures and techniques can provide answers in polylogarithmic time. The presented results have applications ...

متن کامل

RBF: A New Storage Structure for Space-Efficient Queries for Multidimensional Metadata in OSS

Object-based storage systems (OSS) have evolved from the traditionally unintelligent management to intelligent and selfmanaged schemes by delegating low-level management activities to storage devices, and providing new functionalities, such as greater scalability and dynamic reconfiguration. An object consists of data, user-accessible attributes and device-managed metadata, which is responsible...

متن کامل

Multidimensional Structures Dedicated to Continuous Spatiotemporal Phenomena

Multidimensional structures or hypercubes are commonly used in OLAP to store and organize data to optimize query response time. The multidimensional approach is based on the concept of facts analyzed with respect to various dimensions. Dimensions are seen as axes of analysis forming a vector space in which each cell is located by a set of coordinates. In conventional multidimensional structures...

متن کامل

Multidimensional Range Queries on Modern Hardware

Range queries over multidimensional data are an important part of database workloads in many applications. Their execution may be accelerated by using multidimensional index structures (MDIS), such as kd-trees or R-trees. As for most index structures, the usefulness of this approach depends on the selectivity of the queries, and common wisdom told that a simple scan beats MDIS for queries acces...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998